On total edge irregularity strength of categorical product of cycle and path
نویسندگان
چکیده
We investigate a modification of well known irregularity strength of graph, namely the total edge irregularity strength. An edge irregular total k-labeling φ : V ∪E → {1, 2, . . . , k} of a graph G is a labeling of vertices and edges of G in such a way that for any two different edges uv and u′v′ their weights φ(u)+φ(uv)+φ(v) and φ(u′)+φ(u′v′)+φ(v′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. The main purpose of this paper is to solve the open problem posed by Ahmad and Bača.
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملEdge irregular total labeling of certain family of graphs
An edge irregular total k-labeling φ : V (G)∪E(G) → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x) + φ(xy) + φ(y) and φ(x′) + φ(x′y′) + φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have ...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملTotal Edge Irregularity Strength of Strong Product of Cycles and Paths
An irregular assignment is a k -labeling of the edges : {1, 2, , } f E k → ... such that the vertex weights (label sums of edges incident with the vertex) are different for all vertices of G . The smallest k for which there is an irregular assignment is the irregularity strength. The notion of irregularity strength was introduced by Chartrand et al. [8] and studied by numerous authors, see [6,1...
متن کاملOn edge irregularity strength of subdivision of star Sn
In this paper, we study the total edge irregularity strength of some well known graphs. An edge irregular total k-labeling φ : V ∪E → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights are distinct. The total edge irregularity strength tes(G) is defined as the minimum k for which G has an edge irre...
متن کامل